/*
E element();        Retrieves, but does not remove, the head of this queue. This method differs from peek only in that it throws an exception if this queue is empty.
boolean offer(E e); Inserts the specified element into this queue if it is possible to do so immediately without violating capacity restrictions. When using a capacity-restricted queue, this method is generally preferable to add(E), which can fail to insert an element only by throwing an exception.
E peek();           Retrieves, but does not remove, the head of this queue, or returns null if this queue is empty.
E poll();           Retrieves and removes the head of this queue, or returns null if this queue is empty.
E remove();         Retrieves and removes the head of this queue. This method differs from poll only in that it throws an exception if this queue is empty.
*/

public interface IQueue<E> {

	E element();

	boolean offer(E e);

	E peek();

	E poll();

	E remove();

}
